Heegard-Berger Video Coding Using LMMSE Estimator
نویسندگان
چکیده
In this paper a novel distributed video coding scheme was proposed based on Heegard-Berger coding theorem, rather than Wyner-Ziv theorem. The main advantage of HB coding is that the decoder can still decode and output a coarse reconstruction, even if side information degrade or absent. And if side information present or upgrade at decoder, a better reconstruction can be achieved. This robust feature can solve the problem lies in Wyner-Ziv video coding that the encoder can hardly decide the bit rate because rate-distortion was affected by the side information known only at the decoder. This feature also leaded to our HB video coding scheme with 2 decoding level of which we first reconstruct a coarse reconstruction frame without side information, and do motion search in previous reconstructed frame to find side information, then reconstruct a fine reconstruction frame through HB decoding again, with side information available.
منابع مشابه
Polar Codes and Polar Lattices for the Heegard-Berger Problem
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel c...
متن کاملYour Title
Explicit coding schemes are proposed to achieve the rate-distortion bound for the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion bound for the binary case. The nested structure contains two optimal polar codes for lossy source coding and channel coding, respectively. Moreover, a similar nested polar lattice con...
متن کاملCWCU LMMSE Estimation: Prerequisites and Properties
The classical unbiasedness condition utilized e.g. by the best linear unbiased estimator (BLUE) is very stringent. By softening the ”global” unbiasedness condition and introducing component-wise conditional unbiasedness conditions instead, the number of constraints limiting the estimator’s performance can in many cases significantly be reduced. In this work we investigate the component-wise con...
متن کاملIterative Channel Estimation for UMTS Long Term Evolution
In this thesis, different iterative channel estimation algorithms for Long Term Evolution (LTE) downlink are investigated. LTE uses coherent detection, which requires channel state information. In order to achieve high data rate transmission over mobile radio channels, it is essential to have accurate channel state information at the receiver side. For channel estimation purpose LTE provides tr...
متن کاملDistortion Minimization in Gaussian Source Coding with Fading Side Information
We consider a layered approach to source coding that minimizes expected distortion when side information is available through a fading channel. Specifically, we assume a Gaussian source encoder whereby the decoder receives a compressed version of the symbol at a given rate, as well as an uncompressed version over a separate side-information channel with slow fading and noise. The decoder knows ...
متن کامل